Diffusion–Advection Equations on a Comb: Resetting and Random Search
نویسندگان
چکیده
This review addresses issues of various drift–diffusion and inhomogeneous advection problems with without resetting on comblike structures. Both a Brownian diffusion search drift an the comb structures are analyzed. The analytical results verified by numerical simulations in terms coupled Langevin equations for structure. subordination approach is one main technical methods used here, we demonstrated how it can be effective study random resetting.
منابع مشابه
The Range of a Random Walk on a Comb
The graph obtained from the integer grid Z×Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of v, each with probability 1/d(v), where d(v) denotes the degree of v. We answer a question of Csáki, Csörgő, Földes, Révész, and Tusnády by sho...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Profile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملRandom fractional functional differential equations
In this paper, we prove the existence and uniqueness results to the random fractional functional differential equations under assumptions more general than the Lipschitz type condition. Moreover, the distance between exact solution and appropriate solution, and the existence extremal solution of the problem is also considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9030221